x = int(input())
ans = 0
while x:
if x % 2 == 1:
ans += 1
x = int(x / 2)
print(ans)
#include <bits/stdc++.h>
// was created by Ali Karim
#define ioiismine ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
using namespace std;
const int N = 2e6 - 1;
int n , cnt = 0 , a[N] , b , k , c , z[N] , cnt2 = 0 , sum = 0 , m , d , mx2 = 0 , x , y , cnt3 = 0;
bool v1[N];
vector <long long> v;
map <int, int> mp;
set <int> st;
ll mx = 1e18, l;
string s , f[N] , j[N];
char e , g;
void solved_by_ali(){
cin >> n;
for (int i = 1; i <= n; i *= 2) {
if (n & i) cnt ++;
}
cout << cnt;
}
int main()
{
ioiismine
int t = 1;
//cin >> t;
while (t--){
solved_by_ali();
}
return 0;
}
320A - Magic Numbers | 1658A - Marin and Photoshoot |
514A - Chewbaсca and Number | 382A - Ksenia and Pan Scales |
734B - Anton and Digits | 1080A - Petya and Origami |
1642D - Repetitions Decoding | 1440A - Buy the String |
1658F - Juju and Binary String | 478A - Initial Bet |
981A - Antipalindrome | 365A - Good Number |
1204B - Mislove Has Lost an Array | 1409D - Decrease the Sum of Digits |
1476E - Pattern Matching | 1107A - Digits Sequence Dividing |
1348A - Phoenix and Balance | 1343B - Balanced Array |
1186A - Vus the Cossack and a Contest | 1494A - ABC String |
1606A - AB Balance | 1658C - Shinju and the Lost Permutation |
1547C - Pair Programming | 550A - Two Substrings |
797B - Odd sum | 1093A - Dice Rolling |
1360B - Honest Coach | 1399C - Boats Competition |
1609C - Complex Market Analysis | 1657E - Star MST |